Minimalilty of Finite Automata Representation in Hybrid Systems Control
نویسندگان
چکیده
This paper discusses a new approach to representing a finite automaton as a combination of a linear state equation with a smaller set of free binary variables (i.e., input variables) and binary inequalities, in order to reduce the computational time for solving the model predictive control problem of a class of hybrid systems. In particular, this paper is devoted to proving that a system representation derived by our proposed method is minimal in the sense that the number of its binary input variables is minimal among system models over all linear equivalence transformations that preserve the binary property of free (input) variables.
منابع مشابه
Viewing hybrid systems as products of control systems and automata
The purpose of this note is to show how hybrid systems may be modeled as products of nonlinear control systems and finite state automata. By a hybrid system, we mean a network of consisting of continuous, nonlinear control system connected to a discrete finite state automaton. Our point of view is that the automaton switches between the control systems, and that this switching is a function of ...
متن کاملGenerating Discrete Trace Transition System of a Polyhe-dral Invariant Hybrid Automaton
Supervisory control and fault diagnosis of hybrid systems need to have complete information about the discrete states transitions of the underling system. From this point of view, the hybrid system should be abstracted to a Discrete Trace Transition System (DTTS) and represented by a discrete mode transition graph. In this paper an effective method is proposed for generating discrete mode trans...
متن کاملInvisible formal methods for embedded control systems
Embedded control systems typically comprise continuous control laws combined with discrete mode logic. These systems are modeled using a hybrid automaton formalism, which is obtained by combining the discrete transition system formalism with continuous dynamical systems. This paper develops automated analysis techniques for asserting correctness of hybrid system designs. Our approach is based o...
متن کاملSymbolic Verification of Hybrid Systems: An Algebraic Approach
In this paper we present a new symbolic, computer algebra based approach to hybrid systems. Hybrid systems are systems containing both, continuous and discrete changing quantities. As is commonly done, we model hybrid systems using hybrid automata. Hybrid automata extend the classical notion of finite state machines by combining differential equations to model the dynamic behavior of systems wi...
متن کاملViability in Hybrid Systems
Hybrid systems are interacting systems of digital automata and continuous plants subject to disturbances. The digital automata are used to force the state trajectory of the continuous plant to obey a performance specification. For the basic concepts and notation for hybrid systems, see Kohn and Nerode (1993), and other papers in the same volume. Here we introduce tools for analyzing enforcing v...
متن کامل